X.Yu, H. Huang: Efficiency Loss of Mixed Equilibrium Behaviors with Polynomial Cost Functions
نویسنده
چکیده
This paper investigates the efficiency loss of selfish routing simultaneously with user equilibrium (UE) player and Cournot-Nash (CN) players. The upper bound of the efficiency loss of UE-CN mixed equilibrium with polynomial cost functions is obtained by the scaling method and the nonlinear programming method, respectively. It is shown that the upper bound of efficiency loss obtained by the scaling method only depends on the polynomial degree of the link travel cost function and the upper bound of efficiency loss obtained by the nonlinear programming method depends on the number of the CN players besides the aforementioned factors. The numerical tests validate our analytical results.
منابع مشابه
On Colorful Bin Packing Games
We consider colorful bin packing games in which selfish players control a set of items which are to be packed into a minimum number of unit capacity bins. Each item has one of m ≥ 2 colors and cannot be packed next to an item of the same color. All bins have the same unitary cost which is shared among the items it contains, so that players are interested in selecting a bin of minimum shared cos...
متن کاملRemote Sensing and Land Use Extraction for Kernel Functions Analysis by Support Vector Machines with ASTER Multispectral Imagery
Land use is being considered as an element in determining land change studies, environmental planning and natural resource applications. The Earth’s surface Study by remote sensing has many benefits such as, continuous acquisition of data, broad regional coverage, cost effective data, map accurate data, and large archives of historical data. To study land use / cover, remote sensing as an effic...
متن کاملA Multi-Objective Particle Swarm Optimization for Mixed-Model Assembly Line Balancing with Different Skilled Workers
This paper presents a multi-objective Particle Swarm Optimization (PSO) algorithm for worker assignment and mixed-model assembly line balancing problem when task times depend on the worker’s skill level. The objectives of this model are minimization of the number of stations (equivalent to the maximization of the weighted line efficiency), minimization of the weighted smoothness index and minim...
متن کاملGlobal optimization of mixed-integer polynomial programming problems: A new method based on Grobner Bases theory
Mixed-integer polynomial programming (MIPP) problems are one class of mixed-integer nonlinear programming (MINLP) problems where objective function and constraints are restricted to the polynomial functions. Although the MINLP problem is NP-hard, in special cases such as MIPP problems, an efficient algorithm can be extended to solve it. In this research, we propose an algorit...
متن کاملA mixed integer bi-level DEA model for bank branch performance evaluation by Stackelberg approach
One of the most complicated decision making problems for managers is the evaluation of bank performance, which involves various criteria. There are many studies about bank efficiency evaluation by network DEA in the literature review. These studies do not focus on multi-level network. Wu (Eur J Oper Res 207:856–864, 2010) proposed a bi-level structure for cost efficiency at the first time. In t...
متن کامل